@InProceedings{VilelaMaldJinoChai:1994:AbSeRe,
author = "Vilela, Pl{\'{\i}}nio Roberto Souza and Maldonado, Jos{\'e}
Carlos and Jino, Mario and Chaim, Marcos L.",
affiliation = "Departamento de Engenharia de Computa{\c{c}}{\~a}o e
Automa{\c{c}}{\~a}o Industrial (DCA) da Faculdade de Engenharia
El{\'e}trica e de Computa{\c{c}}{\~a}o (FEEC), Universidade
Estadual de Campinas (UNICAMP) and {Instituto de Ci{\^e}ncias
Matem{\'a}ticas de S{\~a}o Carlos da Universidade de S{\~a}o
Paulo (USP)} and Departamento de Engenharia de
Computa{\c{c}}{\~a}o e Automa{\c{c}}{\~a}o Industrial (DCA) da
Faculdade de Engenharia El{\'e}trica e de Computa{\c{c}}{\~a}o
(FEEC), Universidade Estadual de Campinas (UNICAMP) and {Embrapa
Inform{\'a}tica Agropecu{\'a}ria (CNPTIA)}",
title = "Visualiza{\c{c}}{\~a}o de grafos de programa: uma abordagem sem
reposicionamento",
booktitle = "Anais...",
year = "1994",
editor = "Freitas, Carla dal Sasso and Geus, Klaus de and Scheer,
S{\'e}rgio",
pages = "189--196",
organization = "Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e
Processamento de Imagens, 7. (SIBGRAPI)",
publisher = "Sociedade Brasileira de Computa{\c{c}}{\~a}o",
address = "Porto Alegre",
keywords = "grafos de programa, visualiza{\c{c}}{\~a}o, reposicionamento,
engenharia de software.",
abstract = "Program graph visualization has important applications from design
to maintenance in software production. Specially in testing
several software characteristics are observed through
visualization; this is a motivation for the development of
algorithms for automatic generation of program graphs. Several
authors have presented works in associated areas such as trees,
directed planar graphs, general graphs, and specially program
graphs display. Most of these works make use of trial-and-of its
ancestors is required in order to avoid overlapping. An algorithm
which deals with the program graph drawing problem is shown. The
algorithm is composed of two steps: node position computation and
branch routing. For node position computation a modified tree
level calculation function is used to find Y coordinates. In
determining X coordinates a new concept, named scope, was defined.
The main characteristic of this approach is to allow X positions
to be found without relocation. The branch routing uses positions
left free by node position computations to find routing options;
the best ones are chosen for each branch.",
conference-location = "Curitiba, PR, Brazil",
conference-year = "9-11 Nov. 1994",
isbn = "978-85-7669-272-0",
language = "pt",
ibi = "8JMKD3MGPBW34M/3DEAEE8",
url = "http://urlib.net/ibi/8JMKD3MGPBW34M/3DEAEE8",
targetfile = "25 Visualizacao de grafos de programa.pdf",
type = "Linguagens e Visualiza{\c{c}}{\~a}o",
volume = "1",
urlaccessdate = "2024, Apr. 30"
}